A probabilistic distributed algorithm for set intersection and its analysis

A Fast Set Intersection Algorithm for Sorted Sequences

A New Robust Bootstrap Algorithm for the Assessment of Common Set of Weights in Performance Analysis

The performance of the units is defined as the ratio of the weighted sum of outputs to the weighted sum of inputs. These weights can be determined by data envelopment analysis (DEA) models. The inputs and outputs of the related (Decision Making Unit) DMU are assessed by a set of the weights obtained via DEA for each DMU. In addition, the weights are not generally common, but rather, they are ve...

designing and validating a textbook evaluation questionnaire for reading comprehension ii and exploring its relationship with achievement

در هر برنامه آموزشی، مهم ترین فاکتور موثر بر موفقیت دانش آموزان کتاب درسی است (مک دونو و شاو 2003). در حقیقت ، کتاب قلب آموزش زبان انگلیسی است( شلدن 1988). به دلیل اهمیت والای کتاب به عنوان عنصر ضروری کلاس های آموزش زبان ، کتب باید به دقت ارزیابی و انتخاب شده تا از هرگونه تاثیر منفی بر دانش آموزان جلوگیری شود( لیتز). این تحقیق با طراحی پرسش نامه ارزیابی کتاب که فرصت ارزیابی معتبر را به اساتید د...

Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set

Let f, f1, . . . , fs be n-variate polynomials with rational coefficients of maximum degree D and let V be the set of common complex solutions of F = (f1, . . . , fs). We give an algorithm which, up to some regularity assumptions on F, computes an exact representation of the global infimum f? of the restriction of the map x → f (x) to V ∩ Rn, i.e. a univariate polynomial vanishing at f? and an ...

A Set Intersection Algorithm Via x-Fast Trie

This paper proposes a simple intersection algorithm for two sorted integer sequences . Our algorithm is designed based on x-fast trie since it provides efficient find and successor operators. We present that our algorithm outperforms skip list based algorithm when one of the sets to be intersected is relatively ‘dense’ while the other one is (relatively) ‘sparse’. Finally, we propose some possi...